Jacobi--Davidson Method on Low-Rank Matrix Manifolds
نویسندگان
چکیده
منابع مشابه
The Jacobi–Davidson method
The Jacobi–Davidson method is a popular technique to compute a few eigenpairs of large sparse matrices. Its introduction, about a decade ago, was motivated by the fact that standard eigensolvers often require an expensive factorization of the matrix to compute interior eigenvalues. Such a factorization may be infeasible for large matrices as arise in today’s large-scale simulations. In the Jaco...
متن کاملJDSVD: A Jacobi-Davidson like SVD method
We discuss a new method for the iterative computation of a portion of the singular values and vectors of a large sparse matrix. Similar to the Jacobi-Davidson method for the eigenvalue problem, we compute in each step a correction by (approximately) solving a correction equation. It is shown that this JDSVD method can be seen as an accelerated (inexact) Newton scheme. We compare the method with...
متن کاملA Jacobi-Davidson Type SVD Method
We discuss a new method for the iterative computation of a portion of the singular values and vectors of a large sparse matrix. Similar to the Jacobi–Davidson method for the eigenvalue problem, we compute in each step a correction by (approximately) solving a correction equation. We give a few variants of this Jacobi–Davidson SVD (JDSVD) method with their theoretical properties. It is shown tha...
متن کاملA Jacobi-Davidson Method for Nonlinear Eigenproblems
For the nonlinear eigenvalue problem T (λ)x = 0 we consider a Jacobi–Davidson type iterative projection method. The resulting projected nonlinear eigenvalue problems are solved by inverse iteration. The method is applied to a rational eigenvalue problem governing damped vibrations of a structure.
متن کاملSchur method for low-rank matrix approximation
The usual way to compute a low-rank approximant of a matrix H is to take its truncated SVD. However, the SVD is computationally expensive. This paper describes a much simpler generalized Schur-type algorithm to compute similar low-rank approximants. For a given matrix H which has d singular values larger than ε, we find all rank d approximants Ĥ such that H − Ĥ has 2-norm less than ε. The set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2018
ISSN: 1064-8275,1095-7197
DOI: 10.1137/17m1123080